Shortened LDPC codes accelerate OSD decoding performance
نویسندگان
چکیده
Abstract Medium-length LDPC codes are in demand certain areas such as mobile environment (Wi-Fi and Mobile WiMAX) telecommand links from the ground to space because of their lower latency properties. However, length these is rather short, decoding error rates worse than those long-length codes. In this paper, we show that combination shortened codes, whose positions properly selected, ordered statistic (OSD) significantly improves error. For best choice shortening positions, used integer programming approach. particular, utilized Feldman–Wainwright–Karger code polytope for purpose. Some studies have independently reported efficiency OSD methods. This paper emphasizes results multiplicative effectiveness.
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملIterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input output-symmetric (MBIOS) channels are analyzed in this paper. For MS decoding, the analysis is done by upper bounding the bit error probability of the root bit of a tree code by the sequence error probability of a subcode ...
متن کاملCS6782 Probabilistic Graphical Models Decoding LDPC Codes
In this project, I study the application of two techniques to the belief-propagation based decoding of LDPC codes. The first technique, min-sum decoding was implemented in the 1980s by Tanner as a method to reduce computational complexity. The other technique, residual belief propagation optimises the order in which message updates are scheduled in an informed manner, leading to faster and bett...
متن کاملEfficient Decoding Techniques for LDPC Codes
Efficient decoding techniques for LDPC codes are in demand, since these codes are included in many standards nowadays. Although the theoretical performance of LDPC codes is impressive, their practical implementation leads to problems like numerical inaccuracy, limited memory resources, etc. We investigate methods that are suited to reduce the decoding complexity while still keeping the loss in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Eurasip Journal on Wireless Communications and Networking
سال: 2021
ISSN: ['1687-1499', '1687-1472']
DOI: https://doi.org/10.1186/s13638-021-01901-x